Quadratically hyponormal weighted shifts with recursive tail

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quartically Hyponormal Weighted Shifts Need Not Be 3-hyponormal

We give the first example of a quartically hyponormal unilateral weighted shift which is not 3-hyponormal.

متن کامل

Propagation Phenomena for Hyponormal 2-variable Weighted Shifts

We study the class of hyponormal 2-variable weighted shifts with two consecutive equal weights in the weight sequence of one of the coordinate operators. We show that under natural assumptions on the coordinate operators, the presence of consecutive equal weights leads to horizontal or vertical flatness, in a way that resembles the situation for 1-variable weighted shifts. In 1variable, it is w...

متن کامل

Making Mercury Programs Tail Recursive

We present two optimizations for making Mercury programs tail recursive. Both operate by taking computations that occur after a recursive call and moving them before the recursive call, modifying them as necessary. The first optimization moves calls to associative predicates; it is a pure source to source transformation. The second optimization moves construction unifications; it required exten...

متن کامل

Hyponormal Toeplitz Operators on the Weighted Bergman Spaces

In this note we consider the hyponormality of Toeplitz operators Tφ on the Weighted Bergman space Aα(D) with symbol in the class of functions f + g with polynomials f and g of degree 2. Mathematics subject classification (2010): 47B20, 47B35.

متن کامل

Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality

We present efficient distributed δ-approximation algorithms for fractional packing and maximum weighted b-matching in hypergraphs, where δ is the maximum number of packing constraints in which a variable appears (for maximum weighted b-matching δ is the maximum edge degree — for graphs δ = 2). (a) For δ = 2 the algorithm runs in O(logm) rounds in expectation and with high probability. (b) For g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2013

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2013.05.058